package 二叉树.m03.d13.t03;

import 二叉树.m03.TreeNode;

class Solution {
    public int maxDepth(TreeNode root) {
        if(root == null) return 0;
        return Math.max(maxDepth(root.left), maxDepth(root.right))+1;
    }
}